Unlabelled Gibbs partitions
نویسندگان
چکیده
منابع مشابه
Limit shapes for Gibbs ensembles of partitions
We explicitly compute limit shapes for several grand canonical Gibbs ensembles of partitions of integers. These ensembles appear in models of aggregation and are also related to invariant measures of zero range and coagulation-fragmentation processes. We show, that all possible limit shapes for these ensembles fall into several distinct classes determined by the asymptotics of the internal ener...
متن کاملLooking-backward probabilities for Gibbs-type exchangeable random partitions
SERGIO BACALLADO, STEFANO FAVARO and LORENZO TRIPPA Department of Statistics, Stanford University, Sequoia Hall, Stanford, CA 94305, USA. E-mail: [email protected] Department of Economics and Statistics, University of Torino, Corso Unione Sovietica 218/bis, 10134 Torino, Italy. E-mail: [email protected] Harvard School of Public Health and Dana-Faber Cancer Institute, 450 Brooklin...
متن کاملRecord indices and age-ordered frequencies in Exchangeable Gibbs Partitions
We consider a random partition Π of N = {1, 2, . . .} such that, for each n, its restriction Πn to [n] = {1, . . . , n} is given by an exchangeable Gibbs partition with parameters α, V for α ∈ (−∞, 1] and V = (Vn,k) defined recursively by setting V1,1 = 1 and Vn,k = (n− αk)Vn+1,k + Vn+1,k+1 k ≤ n = 1, 2, . . . (Gnedin and Pitman 2006). By ranking the blocks Πn1, . . . , Πnk of Πn by their age-o...
متن کاملGibbs distributions for random partitions generated by a fragmentation process
In this paper we study random partitions of {1, . . . , n} where every cluster of size j can be in any of wj possible internal states. The Gibbs (n, k, w) distribution is obtained by sampling uniformly among such partitions with k clusters. We provide conditions on the weight sequence w allowing construction of a partition valued random process where at step k the state has the Gibbs (n, k, w) ...
متن کاملConstructing unlabelled lattices
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a stabiliser chain approach for cutting branches of the search space that cannot contain a minimal lattice; to make this work, we grow lattices by adding a new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2019
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548319000336